- effectively computable
- мат.эффективно вычислимый
English-Russian scientific dictionary. 2008.
effectively computable
Смотреть что такое "effectively computable" в других словарях:
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Computable number — In mathematics, particularly theoretical computer science and mathematical logic, the computable numbers, also known as the recursive numbers or the computable reals, are the real numbers that can be computed to within any desired precision by a… … Wikipedia
Computable real function — In mathematical logic, specifically computability theory, a function is sequentially computable if, for every computable sequence of real numbers, the sequence is also computable. A function is effectively uniformly continuous if there exists a… … Wikipedia
Effectively separable — In computability theory, two sets of natural numbers are effectively separable if it is possible to separate the sets with a computable set, and effectively inseparable otherwise. Formal definitionLet A and B be disjoint sets of natural numbers.… … Wikipedia
Programming language for Computable Functions — The Programming language for Computable Functions, or PCF, is a typed functional language introduced by Gordon Plotkin in 1977. It is based on the Logic of Computable Functions (LCF) by Dana Scott. It can be considered as a simplified version of… … Wikipedia
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Constructivism (mathematics) — In the philosophy of mathematics, constructivism asserts that it is necessary to find (or construct ) a mathematical object to prove that it exists. When one assumes that an object does not exist and derives a contradiction from that assumption,… … Wikipedia
Linnik's theorem — in analytic number theory answers a natural question after Dirichlet s theorem on arithmetic progressions. It asserts that, if we denote p ( a , d ) the least prime in the arithmetic progression : a + nd , where n runs through the positive… … Wikipedia
Élisabeth Lutz — was a 20th century French mathematician.She was a student of André Weil at the Université de Strasbourg , from 1934 to 1938. In 1935 she began working on aspects of elliptic curves over p adic fields. An elliptic curve over Q can be put in the… … Wikipedia
